Scheduling of Tanker Lightering via a Novel Continuous-Time Optimization Framework

نویسندگان

  • Xiaoxia Lin
  • Emmanuel D. Chajakis
  • Christodoulos A. Floudas
چکیده

The problem of scheduling a fleet of marine vessels for crude oil tanker lightering is addressed. A novel continuous-time mathematical formulation is developed on the basis of the concept of event points proposed in a formulation for short-term scheduling of chemical processes (Ierapetritou, M. G.; Floudas, C. A. Ind. Eng. Chem. Res. 1998, 37, 4341; 1998, 37, 4360. Ierapetritou, M. G.; Hené, T. S.; Floudas, C. A. Ind. Eng. Chem. Res. 1999, 38, 3446). A sequence of event points is introduced for each vessel, and binary variables are defined to determine whether the vessel is to start a task at each event point, while the task consists of mounting a tanker, pumping on oil from it, dismounting the tanker, traveling to the refinery, docking the refinery, pumping off oil, undocking, and traveling back to the anchorage. The mathematical formulation leads to a mixed-integer linear programming (MILP) problem. The model is further extended to incorporate two complicating features of the lightering process: (i) lightering in multiple stages and (ii) loading vessels with material from multiple tankers. A number of case studies are presented, and the computational results demonstrate the effectiveness and efficiency of the proposed approach.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Operating Room Scheduling in Teaching Hospitals: A Novel Stochastic Optimization Model

Background and Objectives: Operating room (OR) scheduling is key to optimal operating room productivity. The significant uncertainty associated with surgery duration renders scheduling of surgical operation a challenging task. This paper proposes a novel computational stochastic model to optimize scheduling of surgeries with uncertain durations. The model considers various surgical operation co...

متن کامل

An Effective Task Scheduling Framework for Cloud Computing using NSGA-II

Cloud computing is a model for convenient on-demand user’s access to changeable and configurable computing resources such as networks, servers, storage, applications, and services with minimal management of resources and service provider interaction. Task scheduling is regarded as a fundamental issue in cloud computing which aims at distributing the load on the different resources of a distribu...

متن کامل

A Hierarchical Production Planning and Finite Scheduling Framework for Part Families in Flexible Job-shop (with a case study)

Tendency to optimization in last decades has resulted in creating multi-product manufacturing systems. Production planning in such systems is difficult, because optimal production volume that is calculated must be consistent with limitation of production system. Hence, integration has been proposed to decide about these problems concurrently. Main problem in integration is how we can relate pro...

متن کامل

A discrete-event optimization framework for mixed-speed train timetabling problem

Railway scheduling is a complex task of rail operators that involves the generation of a conflict-free train timetable. This paper presents a discrete-event simulation-based optimization approach for solving the train timetabling problem to minimize total weighted unplanned stop time in a hybrid single and double track railway networks. The designed simulation model is used as a platform for ge...

متن کامل

A novel technique for a class of singular boundary value problems

In this paper, Lagrange interpolation in Chebyshev-Gauss-Lobatto nodes is used to develop a procedure for finding discrete and continuous approximate solutions of a singular boundary value problem. At first, a continuous time optimization problem related to the original singular boundary value problem is proposed. Then, using the Chebyshev- Gauss-Lobatto nodes, we convert the continuous time op...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003